Harmonic Algebraic Curves and Noncrossing Partitions
نویسندگان
چکیده
Motivated by Gauss’s first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bounded components; its topology is determined by the combinatorial data of a noncrossing matching. Similarly, every complex polynomial gives rise to a related combinatorial object that we call a basketball, consisting of a pair of noncrossing matchings satisfying one additional constraint. We prove that every noncrossing matching arises from some harmonic curve, and deduce from this that every basketball arises from
منابع مشابه
Polynomials, Meanders, and Paths in the Lattice of Noncrossing Partitions
For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n−1 singular fibres. We study the combinatorial topology of C(f) in the generic case when there are exactly n − 1 singular fibres. In this case, the topology of C(f) is determined by the data of an n-tuple of noncrossing matchings on the ...
متن کاملON 2-REGULAR, k-NONCROSSING PARTITIONS
In this paper we prove a bijection between 2-regular, k-noncrossing partitions and k-noncrossing enhanced partitions. Via this bijection we enumerate 2-regular, 3-noncrossing partitions using an enumeration result [1] for enhanced 3-noncrossing partitions. In addition we derive the asymptotics for the numbers of 2-regular, 3-noncrossing partitions using the BirkhoffTrijtzinky analytic theory of...
متن کاملSets, Lists and Noncrossing Partitions
Partitions of [n] = {1, 2, . . . , n} into sets of lists are counted by sequence A000262 in the On-Line Encyclopedia of Integer Sequences. They are somewhat less numerous than partitions of [n] into lists of sets, A000670. Here we observe that the former are actually equinumerous with partitions of [n] into lists of noncrossing sets and give a bijective proof. We show too that partitions of [n]...
متن کاملReduction of m-regular noncrossing partitions
In this paper, we present a reduction algorithm which transforms m-regular partitions of [n] = {1, 2, . . . , n} to (m−1)-regular partitions of [n − 1]. We show that this algorithm preserves the noncrossing property. This yields a simple explanation of an identity due to Simion-Ullman and Klazar in connection with enumeration problems on noncrossing partitions and RNA secondary structures. For ...
متن کاملCombinatorial statistics on type-B analogues of noncrossing partitions and restricted permutations
We define type-B analogues of combinatorial statistics previously studied on noncrossing partitions and show that analogous equidistribution and symmetry properties hold in the case of type-B noncrossing partitions. We also identify pattern-avoiding classes of elements in the hyperoctahedral group which parallel known classes of restricted permutations with respect to their relations to noncros...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 37 شماره
صفحات -
تاریخ انتشار 2007